Non-trivial 3-wise intersecting uniform families

نویسندگان

چکیده

A family of k-element subsets an n-element set is called 3-wise intersecting if any three members in the have non-empty intersection. We determine maximum size such families exactly or asymptotically. One our results shows that for every ?>0 there exists n0 n>n0 and 25+?<kn<12?? then 4(n?4k?3)+(n?4k?4).

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-trivial intersecting uniform sub-families of hereditary families

For a family F of sets, let μ(F) denote the size of a smallest set in F that is not a subset of any other set in F , and for any positive integer r, let F (r) denote the family of r-element sets in F . We say that a family A is of Hilton-Milner (HM ) type if for some A ∈ A, all sets in A\{A} have a common element x / ∈ A and intersect A. We show that if a hereditary family H is compressed and μ...

متن کامل

Weighted Non-Trivial Multiply Intersecting Families

Let n,r and t be positive integers. A family F of subsets of [n]={1,2, . . . ,n} is called r-wise t-intersecting if |F1∩·· ·∩Fr|≥ t holds for all F1, . . . ,Fr ∈F . An r-wise 1-intersecting family is also called an r-wise intersecting family for short. An r-wise t-intersecting family F is called non-trivial if |⋂F∈F F |<t. Let us define the Brace–Daykin structure as follows. F BD = {F ⊂ [n] : |...

متن کامل

Weighted 3-Wise 2-Intersecting Families

Let n and r be positive integers. Suppose that a family F ⊂ 2[n] satisfies |F1 ∩ F2 ∩ F3| ≥ 2 for all F1, F2, F3 ∈ F . We prove that if w < 0.5018 then ∑ F∈F w |F |(1− w)n−|F | ≤ w2.

متن کامل

On Symmetric 3-wise Intersecting Families

A family of sets is said to be symmetric if its automorphism group is transitive, and 3-wise intersecting if any three sets in the family have nonempty intersection. Frankl conjectured in 1981 that if A is a symmetric 3-wise intersecting family of subsets of {1, 2, . . . , n}, then |A| = o(2). Here, we give a short proof of Frankl’s conjecture using a sharp threshold result of Friedgut and Kalai.

متن کامل

3-Wise Exactly 1-Intersecting Families of Sets

Let f(l,t,n) be the maximal size of a family F ⊂ 2[n] such that any l ≥ 2 sets of F have an exactly t ≥ 1-element intersection. If l ≥ 3, it trivially comes from [8] that the optimal families are trivially intersecting (there is a t-element core contained by all the members of the family). Hence it is easy to determine f(l, t, n) = ⌊ l 2(n− 1) ⌋ +1. Let g(l, t, n) be the maximal size of an l-wi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2023

ISSN: ['1872-681X', '0012-365X']

DOI: https://doi.org/10.1016/j.disc.2023.113368